On a Competitive Secretary Problem
نویسندگان
چکیده
Consider a scenario in which there are multiple employers competing to hire the best possible employee. How does the competition between the employers affect their hiring strategies or their ability to hire one of the best possible candidates? In this paper, we address this question by studying a generalization of the classical secretary problem from optimal stopping theory: a set of ranked employers compete to hire from the same random stream of employees, and each employer wishes to hire the best candidate in the bunch. We show how to derive subgame-perfect Nash equilibrium strategies in this game and analyze the impact the competition has on the quality of the hires as a function of the rank of the employer. We present numerical results from simulations of these strategies.
منابع مشابه
Advances on Matroid Secretary Problems: Free Order Model and Laminar Case
The most important open conjecture in the context of the matroid secretary problem claims the existence of an O(1)-competitive algorithm applicable to any matroid. Whereas this conjecture remains open, modified forms of it have been shown to be true, when assuming that the assignment of weights to the secretaries is not adversarial but uniformly at random [23, 20]. However, so far, no variant o...
متن کاملA Simple $O(\log\log(\mathrm{rank}))$-Competitive Algorithm for the Matroid Secretary Problem
Only recently progress has been made in obtaining o(log(rank))-competitive algorithms for the matroid secretary problem. More precisely, Chakraborty and Lachish (2012) presented a O( √ log(rank))-competitive procedure, and Lachish (2014) later presented a O(log log(rank))competitive algorithm. Both these algorithms and their analyses are very involved, which is also reflected in the extremely h...
متن کاملImproved competitive ratio for the matroid secretary problem
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presented to an on-line algorithm in a random order. Each element has a weight associated with it, which is revealed to the algorithm along with the element. After each element is revealed the algorithm must make an irrevocable...
متن کاملA Framework for the Secretary Problem on the Intersection of Matroids
The secretary problem became one of the most prominent online selection problems due to its numerous applications in online mechanism design. The task is to select a maximumweight subset of elements subject to given constraints, where elements arrive one-by-one in random order, revealing a weight upon arrival. The decision whether to select an element has to be taken immediately after its arriv...
متن کاملMatroid Secretaries
We prove that for every proper minor-closed class M of Fp-representable matroids, there exists a O(1)-competitive algorithm for the matroid secretary problem on M. This result relies on the extremely powerful matroid minor structure theory being developed by Geelen, Gerards and Whittle. We also note that for asymptotically almost all matroids, the matroid secretary algorithm that selects a rand...
متن کاملAlgorithms for Secretary Problems on Graphs and Hypergraphs
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L,R. We develop an 8-competitive algorithm for the following secretary problem: Initially given R, and the size of L, the algorithm receives the vertices of L sequentially, in a random order. When a vertex l ∈ L is seen, all e...
متن کامل